作者:萝莉莲籽芯 | 来源:互联网 | 2023-09-17 21:32
篇首语:本文由编程笔记#小编为大家整理,主要介绍了「学习笔记」3.24代码学习相关的知识,希望对你有一定的参考价值。
唉……长叹一声。这几天效率极低啊
最小生成树还是没弄出来.
2031进制转换 题目传不上来呢
def dec2r(n,r):
base=[str(x) for x in range(10)]+[chr(x) for x in range(ord('A'),ord('A')+6)]
a=[]
if r>&#61;2 and r<&#61;10:
while n/r!&#61;0:
a.append(n%r)
n&#61;n/r
a.append(n%r)
return &#39;&#39;.join([str(x) for x in a[::-1]])
elif r>10 and r<&#61;16:
base&#61;base[:r]
while n/r!&#61;0:
a.append(base[n%r])
n&#61;n/r
a.append(base[n%r])
return &#39;&#39;.join([str(x) for x in a[::-1]])
print dec2r(9,2)
print dec2r(25,8)
print dec2r(23,12)
print dec2r(-4,3)
2032杨辉三角
def pas_triangles():
a&#61;[1]
while True:
yield a
a&#61;[sum(i) for i in zip([0]&#43;a,a&#43;[0])]
n&#61;int(raw_input())
g&#61;pas_triangles()
for i in range(n):
print next(g)
2036改革春见吹满地&#xff08;多边形面积&#xff09;
l&#61;map(int,raw_input().split(&#39; &#39;))
n&#61;l[0]
area&#61;[]
for i in range(1,n-1):
s&#61;1.0/2*((l[1]*l[2*i&#43;2]-l[2*i&#43;1]*l[2])&#43;(l[2*i&#43;1]*l[2*i&#43;4]-l[2*i&#43;3]*l[2*i&#43;2])&#43;(l[2*i&#43;3]*l[2]-l[1]*l[2*i&#43;4]))
area.append(s)
print sum(area)